Operational Subsumption, an Ideal Model of Subtyping
نویسنده
چکیده
In a previous paper we have deened a semantic preorder called operational subsumption , which compares terms according to their error generation behaviour. Here we apply this abstract framework to a concrete language, namely the Abadi-Cardelli object calculus. Unlike most semantic studies of objects, which deal with typed equalities and therefore require explicitly typed languages, we start here from a un-typed world. Type inference is introduced in a second step, together with an ideal model of types and subtyping. We show how this approach exibly accommodates for several variants, and nally propose a novel semantic interpretation of structural subtyping as embedding-projection pairs.
منابع مشابه
Labelled Reductions , Runtime Errors , and Operational Subsumption 1
When combining modules it may be the case that the assembly is partially incorrect (errorprone), but nevertheless useful in some contexts. However usual type system will reject such assemblies as soon as they detect a potential error. We propose a more liberal approach: an error in a software configuration is tolerated as long as there are contexts which can use it without reaching the error; a...
متن کاملPrime Numbers Considered Useful: Ontology Encoding for Efficient Subsumption Testing
Multiple inheritance hierarchies are frequently used for the classification of concepts into a taxonomy, to model software by organizing classes into an inheritance hierarchy, for querying object-oriented databases, for knowledge representation, policy enforcement, and subtyping of service interfaces for safe composition and substitution. All these areas apply hierarchies and share the same con...
متن کاملRegular Expression Subtyping for XML Query and Update Languages
XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule may be used anywhere, and an algorithmic version in which the use of subsumption is limited in order to make typechecking syntax-directed and decidable. However, ...
متن کاملCoherent Coercion Abstraction with a step-indexed strong-reduction semantics
The usual notion of type coercions that witness subtyping relations between types is generalized to a more expressive notion of typing coercions that witness subsumption relations between typings, e.g. pairs composed of a typing environment and a type. This is more expressive and allows for a clearer separation of language constructs with and without computational content. This is illustrated o...
متن کاملThe Undecidability of Mitchell's Subtyping Relationship
Mitchell de ned and axiomatized a subtyping relationship (also known as containment, coercibility, or subsumption) over the types of System F (with \!" and \8"). This subtyping relationship is quite simple and does not involve bounded quanti cation. Tiuryn and Urzyczyn quite recently proved this subtyping relationship to be undecidable. This paper supplies a new undecidability proof for this su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 10 شماره
صفحات -
تاریخ انتشار 1997